void sort()
{
	Node*cur=nil;
	Node*node=new Node;
	for(int i=0;i<n;i++)
	for(int j=0;j<n;j++)
	{
		if(cur->name>cur->next->name)
		{
			node->name=cur->name;
			cur->name=cur->next>name;
			cur->next->name=node->name;
		}
		
	}
}
